An improved deterministic local search algorithm for 3-SAT
نویسندگان
چکیده
منابع مشابه
An Improved Local Search Algorithm for 3-SAT
We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.
متن کاملGuided Search and a Faster Deterministic Algorithm for 3-SAT
Most deterministic algorithms for NP-hard problems are splitting algorithms: They split a problem instance into several smaller ones, which they solve recursively. Often, the algorithm has a choice between several splittings. For 3-SAT, we show that choosing wisely which splitting to apply, one can avoid encountering too many worst-case instances. This improves the currently best known determin...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملA local search algorithm for SAT
We present a fairly simple and natural algorithm for SAT which can be viewed as a particular instantiation of the well known k opt heuristic We prove that for most formulas drawn from certain random and semi random distributions on satis able formulas the algorithm nds a satisfying assignment in polynomial time
متن کاملOn an Optimal Deterministic Algorithm for SAT
J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.08.002